• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > JIPS (Çѱ¹Á¤º¸Ã³¸®ÇÐȸ)

JIPS (Çѱ¹Á¤º¸Ã³¸®ÇÐȸ)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) A Mixed Co-clustering Algorithm Based on Information Bottleneck
¿µ¹®Á¦¸ñ(English Title) A Mixed Co-clustering Algorithm Based on Information Bottleneck
ÀúÀÚ(Author) Cao Kerang   Hyunju Lee   Hoekyung Jung   Yongli Liu   Tianyi Duan   Xing Wan   Hao Chao  
¿ø¹®¼ö·Ïó(Citation) VOL 13 NO. 06 PP. 1467 ~ 1486 (2017. 12)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Fuzzy co-clustering is sensitive to noise data. To overcome this noise sensitivity defect, possibilistic clustering relaxes the constraints in FCM-type fuzzy (co-)clustering. In this paper, we introduce a new possibilistic fuzzy co-clustering algorithm based on information bottleneck (ibPFCC). This algorithm combines fuzzy coclustering and possibilistic clustering, and formulates an objective function which includes a distance function that employs information bottleneck theory to measure the distance between feature data point and feature cluster centroid. Many experiments were conducted on three datasets and one artificial dataset. Experimental results show that ibPFCC is better than such prominent fuzzy (co-)clustering algorithms as FCM, FCCM, RFCC and FCCI, in terms of accuracy and robustness.
Å°¿öµå(Keyword) IoT   Priority   Sensor   Smart Home   Task Management System   Co-clustering   F-Measure   Fuzzy Clustering   Information Bottleneck   Objective Function  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå